Forbidden graph characterization

#	Item
21	Contents Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii 1. The Basics . . . . . . . . . . . . . . . . . . . . . . . . . . . . Add to Reading List Source URL: diestel-graph-theory.com Language: English - Date: 2013-08-10 17:09:11 Robertson–Seymour theorem Universal graph Graph Extremal graph theory Forbidden graph characterization Apollonian network Book:Graph Algorithms Graph theory Planar graphs Minor
22	BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 36, Number 3, Pages 389–390 Add to Reading List Source URL: www.ams.org Language: English - Date: 2012-06-12 18:16:06 Homeomorphism Graph property Planar graph Petersen graph Clique Graph coloring Graph Tree Robertson–Seymour theorem Graph theory Forbidden graph characterization Minor
23	FORBIDDEN MINORS AND MINOR-CLOSED GRAPH PROPERTIES DAN WEINER Add to Reading List Source URL: www.math.uchicago.edu Language: English - Date: 2006-08-23 12:00:09 Planar graph Minor Forbidden graph characterization Robertson–Seymour theorem Petersen graph Tree decomposition Tree Edge contraction Graph Graph theory Graph operations Graph coloring